Normal Transversality and Uniform Bounds

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normal transversality and uniform bounds

Let A be a commutative ring. A graded A-algebra U = ⊕n≥0Un is a standard A-algebra if U0 = A and U = A[U1] is generated as an A-algebra by the elements of U1. A graded U -module F = ⊕n≥0Fn is a standard U -module if F is generated as an U -module by the elements of F0, that is, Fn = UnF0 for all n ≥ 0. In particular, Fn = U1Fn−1 for all n ≥ 1. Given I, J , two ideals of A, we consider the follo...

متن کامل

Uniform and Non-uniform Bounds in Normal Approximation for Nonlinear Statistics

Let T be a general sampling statistic that can be written as a linear statistic plus an error term. Uniform and non-uniform Berry-Esseen type bounds for T are obtained. The bounds are best possible for many known statistics. Applications to U-statistic, multi-sample U-statistic, L-statistic, random sums, and functions of non-linear statistics are discussed.

متن کامل

Uniform Bounds on Multigraded Regularity

We give an effective uniform bound on the multigraded regularity of a subscheme of a smooth projective toric variety X with a given multigraded Hilbert polynomial. To establish this bound, we introduce a new combinatorial tool, called a Stanley filtration, for studying monomial ideals in the homogeneous coordinate ring of X . As a special case, we obtain a new proof of Gotzmann’s regularity the...

متن کامل

Uniform Bounds for Bessel Functions

For ν > −1/2 and x real we shall establish explicit bounds for the Bessel function Jν(x) which are uniform in x and ν. This work and the recent result of L. J. Landau [7] provide relatively sharp inequalities for all real x.

متن کامل

Improved Uniform Test Error Bounds

We derive distribution free uniform test error bounds that improve on VC type bounds for validation We show how to use knowledge of test inputs to improve the bounds The bounds are sharp but they require intense computation We introduce a method to trade sharpness for speed of computation Also we compute the bounds for several test cases Key wordsmachine learning learning theory generalization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the London Mathematical Society

سال: 2000

ISSN: 0024-6107

DOI: 10.1112/s0024610700001538